Tree dependence analysis
نویسندگان
چکیده
منابع مشابه
Data Dependence Analysis for the Parallelization of Numerical Tree Codes
Data dependence analysis for automatic parallelization of sequential tree codes is discussed. Hierarchical numerical algorithms often use tree data structures for unbalanced, adaptively and dynamically created trees. Moreover, such codes often do not follow a strict divide and conquer concept, but introduce some geometric neighborhood data dependence in addition to parent-children dependencies....
متن کاملDependence of tree copy functions
The graph copy function when restricted to the set of trees or of rooted trees is called the tree copy function or the rooted tree copy function, respectively. We show that both the set of tree copy functions and the set of rooted tree copy functions are strongly linearly independent. We also show that the set of all tree copy functions are algebraically independent but the set of all rooted tr...
متن کاملConditional Dependence in Longitudinal Data Analysis
Mixed models are widely used to analyze longitudinal data. In their conventional formulation as linear mixed models (LMMs) and generalized LMMs (GLMMs), a commonly indispensable assumption in settings involving longitudinal non-Gaussian data is that the longitudinal observations from subjects are conditionally independent, given subject-specific random effects. Although conventional Gaussian...
متن کاملDependence Tree Structure Estimation via Copula
We propose an approach for dependence tree structure learning via copula. A nonparametric algorithm for copula estimation is presented. Then a Chow-Liu like method based on dependence measure via copula is proposed to estimate maximum spanning bivariate copula associated with bivariate dependence relations. The main advantage of the approach is that learning with empirical copula focuses on dep...
متن کاملNonlinear Array Dependence Analysis Nonlinear Array Dependence Analysis
Standard array data dependence techniques can only reason about linear constraints. There has also been work on analyzing some dependences involving polynomial constraints. Analyzing array data dependences in real-world programs requires handling many \unanalyzable" terms: subscript arrays, run-time tests, function calls. The standard approach to analyzing such programs has been to omit and ign...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2015
ISSN: 0362-1340,1558-1160
DOI: 10.1145/2813885.2737972